【LeetCode 73】Set Matrix Zeroes 矩阵置零


“The Linux philosophy is “Laugh in the face of danger”.Oops.Wrong One. “Do it yourself”. Yes, that”s it.”
Linux的哲学就是“在危险面前放声大笑”,呵呵,不是这句,应该是“一切靠自己,自力更生”才对。

[LeetCode 73]Set Matrix Zeroes 矩阵置零

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
/**
* 给定一个 m x n 的矩阵,如果一个元素为 0,则将其所在行和列的所有元素都设为 0。请使用原地算法。
*
* 用第一行第一列记录每一行每一列的信息,用两个int记录第一行第一列的信息
*/

public class leetcode73 {

public void setZeroes (int[][] matrix) {
int row0Flag = 1, colum0Flag = 1;
for (int i = 0; i < matrix[0].length; i++) {
if (matrix[0][i] == 0) {
row0Flag = 0;
break;
}
}
for (int i = 0; i < matrix.length; i++) {
if (matrix[i][0] == 0) {
colum0Flag = 0;
break;
}
}
for (int i = 1; i < matrix[0].length; i++) {
for (int j = 0; j < matrix.length; ++j) {
if (matrix[i][j] == 0) {
matrix[0][i] = 0;
break;
}
}
}
for (int i = 1; i < matrix.length; i++) {
for (int j = 0; j < matrix[0].length; ++j) {
if (matrix[i][j] == 0) {
matrix[i][0] = 0;
break;
}
}
}
for (int i = 0; i < matrix[0].length; ++i) {
if (matrix[0][i] == 0) {
for (int j = 0; j < matrix.length; ++j) {
matrix[i][j] = 0;
}
}
}
for (int i = 0; i < matrix.length; ++i) {
if (matrix[i][0] == 0) {
for (int j = 0; j < matrix[0].length; ++j) {
matrix[i][j] = 0;
}
}
}
if (row0Flag == 0) {
for (int i = 0; i < matrix[0].length; ++i) {
matrix[0][i] = 0;
}
}
if (colum0Flag == 0) {
for (int i = 0; i < matrix.length; ++i) {
matrix[i][0] = 0;
}
}

}
}
Thanks!